Multiple-resource and multiple-depot emergency response problem considering secondary disasters
نویسندگان
چکیده
منابع مشابه
Development of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کاملSolving the multiple-depot vehicle scheduling problem
The Multiple-Depot Vehicle Scheduling Problem (MDVSP) is the problem where one wants to assign timetabled tasks to vehicles which are housed in multiple depots. This problem is highly relevant for the public transport domain, as competition grows fierce and companies need to stay competitive to survive. As solving the MDVSP optimally is difficult in practice, the aim of this thesis is to give a...
متن کاملSolving Multiple Fuels Dynamic Environmental/Economic Dispatch Problem and Incentive Based Demand Response Considering Spinning Reserve Requirements
In this paper a new integrated model of the dynamic environmental/economic dispatch (DEED) problem and emergency demand response program (EDRP) has been presented by which their interactions are investigated. DEED schedules the online generators power output over the whole dispatch period subject to some practical constraints so that the fuel costs and emission are optimized simultaneously. EDR...
متن کاملIterated local search for the multiple depot vehicle scheduling problem
The multiple depot vehicle scheduling problem (MDVSP) is a well-known and important problem arising in public transport. Although many solution approaches have been published in the literature, algorithms using metaheuristics appeared only very recently (Large Neighborhood Search and Tabu Search). In this paper, we introduce an Iterated Local Search algorithm for the MDVSP, incorporating a neig...
متن کاملAlgorithm for a Generalized, Multiple Depot Hamiltonian Path Problem
We consider a Generalized, Multiple Depot Hamiltonian Path Problem (GMDHPP) and show that it has an algorithm with an approximation ratio of 32 if the costs are symmetric and satisfy the triangle inequality. This improves on the 2-approximation algorithm already available for the same.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems with Applications
سال: 2012
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2012.03.016